Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
نویسندگان
چکیده
منابع مشابه
A Comparison of Multicast Trees and Algorithms
Multicast trees can be shared across sources or may be source-speciic. Inspired by recent interests in using shared trees for interdomain mul-ticasting BFC93] WLE + 92], this paper investigates the trade-oos among diierent algorithms and tree types. Because of the dynamic nature of graphs, only worst case delay bounds can be calculated using analytical methods. We present simulation results ove...
متن کاملon the equivalence of constructed-response and multiple-choice : stem-equivalent, stem non-equivalent but content equivalent, and stem and content non-equivalent items in reading comprehension using multifaceted rasch
the present study investigated construct equivalence of multiple choice (mc) and constructed response (cr) item types across stem and content equivalent mc and cr items (item type ‘a’), non-stem-equivalent but content equivalent mc and cr items (item type ‘b’), and non-stem and non-content equivalent mc and cr items (item type ‘c’). one hundred seventy english-major undergraduates completed mc ...
Content Distribution in Overlay Multicast
Multicast is an important communication paradigm, upon which many distribution applications are built, such as video-on-demand, live broadcasting, teleconferencing, large-volume content dissemination, etc. The efforts to support multicast at IP layer, however, have proved to be slow and painful, due to factors such as ISP’s lack of incentives, shortage of address space, difficulty to support re...
متن کاملContent Distribution: P2P or Multicast
Content distribution is the original application of both multicast and peer-to-peer (P2P) technologies. Since they are two fundamentally different approaches, it is a controversy to discuss who plays better. In this position paper, I will argue that although multicast solution conserves some total network bandwidth consuming, P2P technique is better on content distribution applications in terms...
متن کاملThe Trade - o s of Multicast Trees and Algorithms 1
Multicast trees can be shared across sources (shared trees) or may be source-speciic (shortest path trees). Inspired by recent interests in using shared trees for interdomain multicasting, we investigate the trade-oos among shared tree types and source speciic shortest path trees, by comparing performance over both individual multicast group and the whole network. The performance is evaluated i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2015
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2015.03.004